Pattern generating procedure for the cutting stock problem
نویسنده
چکیده
One of the factors that add to the complexity of the cutting stock problem is the large number of the cutting patterns that may be encountered. When the cutting stock problem is expressed as an integer-programming problem, the large number of cutting patterns involved generally makes computation infeasible. However, if the linear programming formulation of the cutting stock problem is free of integer variables, then the e!ect of the number of cutting patterns will be mitigated. An auxiliary problem arises from the formulation where the columns of the linear programming constraint matrix need to be determined. In this work, a simple pattern generating procedure is developed for solving the auxiliary problem. It is based on an ad hoc solution method described in literature for the knapsack problem. A search tree is used to develop the pattern generation method. Examples are given to illustrate the procedure and its applications. 2001 Elsevier Science B.V. All rights reserved.
منابع مشابه
An Algorithm for Two Dimensional Cutting Stock Problems with Demand
In this paper, two-dimensional cutting stock problem with demand has been studied.In this problem, cutting of large rectangular sheets into specific small pieces should be carried out hence, the waste will be minimized. Solving this problem is important to decrease waste materials in any industry that requires cutting of sheets. In most previus studies, the demand of pieces has not been usually...
متن کاملAn Algorithm for Two Dimensional Cutting Stock Problems with Demand
In this paper, two-dimensional cutting stock problem with demand has been studied.In this problem, cutting of large rectangular sheets into specific small pieces should be carried out hence, the waste will be minimized. Solving this problem is important to decrease waste materials in any industry that requires cutting of sheets. In most previus studies, the demand of pieces has not been usually...
متن کاملAn ACO algorithm for one-dimensional cutting stock problem
The one-dimensional cutting stock problem, has so many applications in lots of industrial processes and during the past few years has attracted so many researchers’ attention all over the world. In this paper a meta-heuristic method based on ACO is presented to solve this problem. In this algorithm, based on designed probabilistic laws, artificial ants do select various cuts and then select the...
متن کاملA simple approach to the two-dimensional guillotine cutting stock problem
Cutting stock problems are within knapsack optimization problems and are considered as a non-deterministic polynomial-time (NP)-hard problem. In this paper, two-dimensional cutting stock problems were presented in which items and stocks were rectangular and cuttings were guillotine. First, a new, practical, rapid, and heuristic method was proposed for such problems. Then, the ...
متن کاملIntegrated approaches for generating and sequencing cutting patterns in two-dimensional cutting stock problems
This paper deals with the classical two-dimensional cutting stock problem, which consists of generating cutting patterns to produce bi rectangular items of sizes (li,wi), i=1,..,m, from rectangular objects of sizes (L,W), so that an objective is optimized, for example, the cost or trim loss. However, to cut the patterns they should be sequenced in such a way as to optimize another objective, fo...
متن کامل